A survey of effective heuristics and their application to a variety of knapsack problems
نویسندگان
چکیده
We present a family of knapsack problems (KPs) while highlighting their particular applications. Though most of the problems are derived from the classical KP, the differences arise in the addition or modification of the constraints or in the way the objective function is defined. Appropriate techniques that were found to be successful in solving these problems are briefly reviewed. Hybrid methods that combine the strengths of different methods such as exact and heuristics are also briefly discussed. Some research avenues that we believe to be useful and challenging are also pointed out.
منابع مشابه
Generation Methods for Multidimensional Knapsack Problems and their Implications
Although there are a variety of heuristics developed and applied to the variants of the binary knapsack problem, the testing of these heuristics are based on poorly defined test problems. This paper reviews the various types of knapsack problems, considers how test problems have been generated and depicts via empirical results the implications of using poorly formed test problems for empirical ...
متن کاملA generalized implicit enumeration algorithm for a class of integer nonlinear programming problems
Presented here is a generalization of the implicit enumeration algorithm that can be applied when the objec-tive function is being maximized and can be rewritten as the difference of two non-decreasing functions. Also developed is a computational algorithm, named linear speedup, to use whatever explicit linear constraints are present to speedup the search for a solution. The method is easy to u...
متن کاملThe Special Application of Vehicle Routing Problem with Uncertainty Travel Times: Locomotive Routing Problem
This paper aims to study the locomotive routing problem (LRP) which is one of the most important problems in railroad scheduling in view of involving expensive assets and high cost of operating locomotives. This problem is assigning a fleet of locomotives to a network of trains to provide sufficient power to pull them from their origins to destinations by satisfying a rich set of operational con...
متن کاملAnt Colony Optimization and Multiple
The ant colony optimization algorithms and their applications on the multiple knapsack problem (MKP) are introduced. The MKP is a hard combinatorial optimization problem with wide application. Problems from different industrial fields can be interpreted as a knapsack problem including financial and other management. The MKP is represented by a graph, and solutions are represented by paths throu...
متن کاملA dynamic programming approach for solving nonlinear knapsack problems
Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. Despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...
متن کامل